Adaptive Boolean Monotonicity Testing in Total Influence Time
نویسندگان
چکیده
The problem of testing monotonicity of a Boolean function f : {0, 1}n → {0, 1} has received much attention recently. Denoting the proximity parameter by ε, the best tester is the non-adaptive Õ( √ n/ε) tester of Khot-Minzer-Safra (FOCS 2015). Let I(f) denote the total influence of f . We give an adaptive tester whose running time is I(f)poly(ε logn).
منابع مشابه
Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces
We give a poly(logn, 1/ε)-query adaptive algorithm for testing whether an unknown Boolean function f : {−1, 1}n → {−1, 1}, which is promised to be a halfspace, is monotone versus ε-far from monotone. Since non-adaptive algorithms are known to require almost Ω(n) queries to test whether an unknown halfspace is monotone versus far from monotone, this shows that adaptivity enables an exponential i...
متن کاملD ec 2 01 4 Boolean function monotonicity testing requires ( almost ) n 1 / 2 non - adaptive queries Xi
We prove a lower bound of Ω(n), for all c > 0, on the query complexity of (two-sided error) non-adaptive algorithms for testing whether an n-variable Boolean function is monotone versus constant-far from monotone. This improves a Ω̃(n) lower bound for the same problem that was recently given in [CST14] and is very close to Ω(n), which we conjecture is the optimal lower bound for this model.
متن کامل2 TESTING MONOTONICITY : O ( n ) UPPER BOUND
1 Overview 1.1 Last time • Proper learning for P implies property testing of P (generic, but quite inefficient) • Testing linearity (over GF[2]), i.e. P = {all parities}: (optimal) O 1-query 1-sided non-adaptive tester. • Testing monotonicity (P = {all monotone functions}: an efficient O n-query 1-sided non-adaptive tester.
متن کاملOptimal bounds for monotonicity and Lipschitz testing over the hypercube
The problem of monotonicity testing of the boolean hypercube is a classic well-studied, yet unsolved question in property testing. We are given query access to f : {0, 1} 7→ R (for some ordered range R). The boolean hypercube B has a natural partial order, denoted by ≺ (defined by the product of coordinate-wise ordering). A function is monotone if all pairs x ≺ y in B, f(x) ≤ f(y). The distance...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 25 شماره
صفحات -
تاریخ انتشار 2018